Robust MST-Based Clustering Algorithm

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel MST based Multi-Prototype Clustering Algorithm

Clustering is the process of partitioning the data objects such that the degree of similarity among the objects in the same partition is more than the degree of dissimilarity between the objects of different classes. There are many applications of clustering like medicine, marketing, insurance, image analysis etc. The squared-error clustering algorithm uses single prototype to represent a clust...

متن کامل

Robust self-stabilizing weight-based clustering algorithm

Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such networks cannot rely on centralized and organized network management. The clustering problem consists of partitioning network nodes into non-overlapping groups called clusters. Clusters give a hierarchical organization to the network that facilitates the network management a...

متن کامل

A Robust Speaker Clustering Algorithm

In this paper, we present a novel speaker segmentation and clustering algorithm. The algorithm automatically performs both speaker segmentation and clustering without any prior knowledge of the identities or the number of speakers. Our algorithm uses “standard” speech processing components and techniques such as HMMs, agglomerative clustering, and the Bayesian Information Criterion. However, we...

متن کامل

A Robust Information Clustering Algorithm

We focus on the scenario of robust information clustering (RIC) based on the minimax optimization of mutual information (MI). The minimization of MI leads to the standard mass-constrained deterministic annealing clustering, which is an empirical risk-minimization algorithm. The maximization of MI works out an upper bound of the empirical risk via the identification of outliers (noisy data point...

متن کامل

Robust Self-stabilizing Clustering Algorithm

Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such network cannot rely on centralized and organized network management. The clustering problem consists in partitioning network nodes into groups called clusters, thus giving at the network a hierarchical organization. A self-stabilizing algorithm, regardless of the initial sys...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Neural Computation

سال: 2018

ISSN: 0899-7667,1530-888X

DOI: 10.1162/neco_a_01081